When Are Prime Formulae Characteristic?
نویسندگان
چکیده
In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic formulae, are exactly the consistent and prime ones. This paper presents general, sufficient conditions guaranteeing that characteristic formulae are exactly the consistent and prime ones. It is shown that the given conditions apply to the logics characterizing all the semantics in van Glabbeek’s branching-time spectrum.
منابع مشابه
On generalized reduced representations of restricted Lie superalgebras in prime characteristic
Let $mathbb{F}$ be an algebraically closed field of prime characteristic $p>2$ and $(g, [p])$ a finite-dimensional restricted Lie superalgebra over $mathbb{F}$. It is showed that anyfinite-dimensional indecomposable $g$-module is a module for a finite-dimensional quotient of the universal enveloping superalgebra of $g$. These quotient superalgebras are called the generalized reduced enveloping ...
متن کاملPrime Compilation of Non-Clausal Formulae
Formula compilation by generation of prime implicates or implicants finds a wide range of applications in AI. Recent work on formula compilation by prime implicate/implicant generation often assumes a Conjunctive/Disjunctive Normal Form (CNF/DNF) representation. However, in many settings propositional formulae are naturally expressed in non-clausal form. Despite a large body of work on compilat...
متن کاملCo-Z Divisor Addition Formulae in Jacobian of Genus 2 Hyperelliptic Curves over Prime Fields
in this paper we proposed a new approach to divisor scalar multiplication in Jacobian of genus 2 hyperelliptic curves over fields with odd characteristic, without field inversion. It is based on improved addition formulae of the weight 2 divisors in projective divisor representation in most frequent case that suit very well to scalar multiplication algorithms based on Euclidean addition chains....
متن کاملThe primitive idempotents of the p-permutation ring
Let G be a finite group, let p be a prime number, and let K be a field of characteristic 0 and k be a field of characteristic p, both large enough. In this note we state explicit formulae for the primitive idempotents of K ⊗Z ppk(G), where ppk(G) is the ring of p-permutation kG-modules. AMS Subject Classification : 19A22, 20C20.
متن کاملCompiling Devices and Processes
This paperpresents a new approach for exploiting Truth Maintenance Systems(TMSs in which the inference engine can convey locality in its knowledge to the TMS . This approach is ideally suited for systems which reason about the physical world because much of knowledge is inherently local, i .e ., the constraints for a particular component or process usually only interact with constraints of phys...
متن کامل